A Scalable Digit-Parallel Polynomial Multiplier Architecture for NIST-Standardized Binary Elliptic Curves
نویسندگان
چکیده
This work presents a scalable digit-parallel finite field polynomial multiplier architecture with digit size of 32 bits for NIST-standardized binary elliptic fields. First, dedicated is proposed each recommended by NIST, i.e., 163, 233, 283, 409 and 571. Then, having support all variants fields curves proposed. For performance investigation, we have compared architectures design. After this, the are most relevant state-of-the-art multipliers. All implemented in Verilog HDL using Vivado IDE tool. The implementation results reported on 28 nm Virtex-7 FPGA technology. multipliers utilize slices 1182 (for m=163), 1451 m=233), 1589 m=283), 2093 m=409) 3451 m=571). Moreover, our designs can operate at maximum frequency 500, 476, 465, 451 443 MHz. Similarly, supported fields, (i) utilizes 3753 slices, (ii) achieves 305 MHz clock frequency, (iii) takes 0.013 ?s one multiplication (iv) consumes 3.905 W power. more area-efficient than recent Consequently, comparison to state art reveal that well suited cryptographic applications.
منابع مشابه
A Versatile and Scalable Digit-Serial/Parallel Multiplier Architecture for Finite Fields GF(2m)
We present an architecture for digit-serial multiplication in finite fields GF(2m) with applications to cryptography. The proposed design uses polynomial basis representation and interleaves multiplication steps with degree reduction steps. An M-bit multiplier works with arbitrary irreducible polynomials and can be used for any binary field of order 2m ≤ 2M . We introduce a new method for degre...
متن کاملExtractors for binary elliptic curves
A deterministic extractor for an elliptic curve is a function that converts a random point on the curve to a random-looking bit-string, which is statistically close to a uniformly random bit-string. The problem of converting random points of an elliptic curve into random bits has several cryptographic applications. In this talk, we propose two simple and efficient deterministic extractors for a...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملA DIGIT-SERIAL POLYNOMIAL BASIS GF(2m) MULTIPLIER
ABSTRACT This paper introduces a digit-serial GF(2m) multiplier for use in the polynomial basis. The multiplier works with the most significant digit first and is scalable to an arbitrary digit size and can be constructed for any GF(2m). It is derived from a commonly used MSB first bit-serial multiplier, known as the standard shift-register multiplier. As the latency of the multiplier decreases...
متن کاملA Scalable and Unified Multiplier Architecture
We describe a scalable and unified architecture for a Montgomery multiplication module which operates in both types of finite fields GF (p) and GF (2). The unified architecture requires only slightly more area than that of the multiplier architecture for the field GF (p). The multiplier is scalable, which means that a fixed-area multiplication module can handle operands of any size, and also, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2022
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app12094312